Parallel Cost Centre Prooling
نویسندگان
چکیده
Good prooling is a major issue in extracting performance from parallel programs. We report on a novel synthesis of sequential cost-centre prooling and state-of-the-art parallel simulation for the pure functional language Haskell that promises to provide detailed and accurate information about parallel Haskell programs. Exploiting simulation also improves the quality of sequential cost centre prooling, though at a signiicant performance overhead.
منابع مشابه
Towards Automatic Support of Parallel Sparse
In this paper, we present a generic matrix class in Java and a runtime environment with continuous compilations aiming to support automatic parallelization of sparse computations on distributed environments. Our package comes with a collection of matrix classes including operators of dense matrix, sparse matrix, and parallel matrix on distributed memory environments. In our environment, a progr...
متن کاملTheory , practice , and a tool for BSPperformance predictionJonathan
The Bulk Synchronous Parallel (BSP) model provides a theoretical framework to accurately predict the execution time of parallel programs. In this paper we describe a BSP programming library that has been developed and contrast two approaches to analysing performance: (1) a pencil and paper method; (2) a prooling tool that analyses trace information generated during program execution. These appr...
متن کاملTime and Space Prooling for Non-strict, Higher-order Functional Languages 1 Motivation and Overview
We present the rst prooler for a compiled, non-strict, higher-order, purely functional language capable of measuring time as well as space usage. Our pro-ler is implemented in a production-quality optimising compiler for Haskell, has low overheads, and can successfully proole large applications. A unique feature of our approach is that we give a formal speciication of the attribution of executi...
متن کاملExtracting Characteristics from Functional Programs for Mapping to Massively Parallel Machines
For problems with highly dynamic behavior, our experiments showed that there are speciic characteristics for diierent applications. We therefore propose a mapping environment providing several strategies for both granularity control and dynamic load balancing. For appropriate selection and parameterization of strategies, we extract the application characteristics using trace-based prooling and ...
متن کاملA Strategic Profiler for Glasgow Parallel Haskell
Execution prooling plays a crucial part in the performance-improving process for parallel functional programs. This paper presents the design, implementation, and use of a new execution time prooler (GranSim-SP) for Glasgow Parallel Haskell (GpH). Parallelism is introduced in GpH by using evaluation strategies, which provide a clean way of coordinating parallel threads without destroying a prog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997